Spectral graph theory: Applications of Courant-Fischer∗
نویسنده
چکیده
In this second talk we will introduce the Rayleigh quotient and the CourantFischer Theorem and give some applications for the normalized Laplacian. Our applications will include structural characterizations of the graph, interlacing results for addition or removal of subgraphs, and interlacing for weak coverings. We also will introduce the idea of “weighted graphs”.
منابع مشابه
Courant-Fischer and Graph Coloring
4.1 Eigenvalues and Optimization I cannot believe that I have managed to teach three lectures on spectral graph theory without giving the characterization of eigenvalues as solutions to optimization problems. It is one of the most useful ways of understanding eigenvalues of symmetric matrices. To begin, let A be a symmetric matrix with eigenvalues α1 ≥ α2 ≥ · · · ≥ αn, and corresponding orthono...
متن کاملCoding Theory and Random Graphs APC 529
6 Spectral Graph Theory 16 6.1 Graph Laplacian . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 6.2 Polynomial interlacing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 6.2.1 An Application to Expander Graphs . . . . . . . . . . . . . . . . . . 18 6.3 Connectivity as a Minimization Problem . . . . . . . . . . . . . . . . . . . . 20 6.4 Courant-Fisher and Alg...
متن کاملCs-621 Theory Gems
In Lecture 10, we introduced a fundamental object of spectral graph theory: the graph Laplacian, and established some of its basic properties. We then focused on the task of estimating the value of eigenvalues of Laplacians. In particular, we proved the Courant-Fisher theorem that is instrumental in obtaining upper-bounding estimates on eigenvalues. Today, we continue by showing a technique – s...
متن کاملA Maxmin Principle for Nonlinear Eigenvalue Problems with Application to a Rational Spectral Problem in Fluid–solid Vibration
In this paper we prove a maxmin principle for nonlinear nonoverdamped eigenvalue problems corresponding to the characterization of Courant, Fischer and Weyl for linear eigenproblems. We apply it to locate eigenvalues of a rational spectral problem in fluid-solid interaction. Dedicated to Prof. Dr. Karel Rektorys on the occasion of his 80th birthday
متن کاملSIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کامل